Equilibrium Sets of Some GI/M/1 Queues (with more examples)

نویسندگان

  • N. Hemachandra
  • Sandhya Tripathi
  • Kishor Patil
چکیده

We view queue as a service facility and consider the situation when users offer arrival rate at stationarity that depends on the Quality of Service (QoS) they experience. We study the equilibrium points and the equilibrium sets associated with this interaction and their interpretations in terms of business cycles. The queue implements the optimal admission control (either discounted or ergodic) policy in the presence of holding cost and admission charge for admitted customers; threshold policies are known to be optimal for such queues. We consider two QoS measures: the long run fraction of customers lost, L, and the long run rate of customers lost, L1. Our first result is that both the QoS measures for GI/M/1 queues are locally continuous with respect to the arrival rate. ForM/M/1 queues we show that control limit is finite and that (Assumption A1) the QoS measures increase with arrival rate. We also show that multiple optimal policies lead to equilibrium sets. We observe that various combinations of cost criteria and QoS measures lead to differing equilibrium behaviour. Under A1, similar results hold for D/M/1 queue. We study a GI/M/1 queue with discrete arrival rate supports whose arrival rate is locally continuous. We illustrate that A1 need not hold, but a relaxed assumption may hold. Nonetheless, change of support is another cause for emergence of equilibrium sets and equilibrium behaviour is interesting as there may be multiple equilibrium points/sets, etc. Generalized equilibrium sets may also exist; these are usually due to the non-contraction nature of the QoS measure, the rate of customers lost, L1. We present details of some computational examples that were are not presented in (8). keywords: admission control of queues; quality of service; multiple optimal policies; change of support; invariant sets; generalized equilibrium sets; non-contraction maps; fixed points; parametrized MDPs

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coupled coincidence point in ordered cone metric spaces with examples in game theory

In this paper, we prove some coupled coincidence point theorems for mappings with the mixed monotone property and obtain the uniqueness of this coincidence point. Then we providing useful examples in Nash equilibrium.

متن کامل

Duality and Other Results for M/G/1 and GI/M/1 Queues, Via a New Ballot Theorem

We generalize the classical ballot theorem and use it to obtain direct probabilistic derivations of some well-known and some new results relating to busy and idle periods and waiting times in M/G/1 and GI/M/1 queues. In particular, we uncover a duality relation between the joint distribution of several variables associated with the busy cycle in M/G/1 and the corresponding joint distribution in...

متن کامل

Some results on maximal open sets

In this paper, the notion of maximal m-open set is introduced and itsproperties are investigated. Some results about existence of maximal m-open setsare given. Moreover, the relations between maximal m-open sets in an m-spaceand maximal open sets in the corresponding generated topology are considered.Our results are supported by examples and counterexamples.

متن کامل

On the Relaxation Time for Single Server Queues

This paper gives a natural definition of the relaxation time for general single server queues. First, we describe a GI/GI/I queue as a limit of GI/GPH/I queues. Each GI/GPH/I queue is transferred to some equivalent bulk arrival GIx/M/I queue, which is formulated by a spatially homogeneous Markov chain with reflecting barrior at zero. An upper bound, which is easy to calculate, of the relaxation...

متن کامل

Representing Workloads in GI/G/1 Queues Through the Preemptive-Resume LIFO Queue Discipline

We give in this paper a detailed sample-average analysis of GI/G/1 queues with the preemptive-resume LIFO (last-in-first-out) queue discipline: We study the long-run “state” behavior of the system by averaging over arrival epochs, departure epochs, as well as time, and obtain relations that express the resulting averages in terms of basic characteristics within busy cycles. These relations, tog...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016